A Discrete Artificial Bee Colony Algorithm for TSP Problem
نویسندگان
چکیده
In this paper, a new discrete artificial bee colony algorithm is used to solve the symmetric traveling salesman problem (TSP). The concept of Swap Operator has been introduced to the original artificial bee colony (ABC) algorithm which can help the bees to generate a better candidate tour by greedy selection. By taken six typical TSP instances as examples, the proposed algorithm is compared with particle swarm optimization (PSO) algorithm to validate its performance. In the experimental study, we also analysis the important parameters in the artificial bee colony algorithm and their influence have been verified.
منابع مشابه
BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملOPTIMIZATION OF RC FRAMES BY AN IMPROVED ARTIFICIAL BEE COLONY ALGORITHM
A new meta-heuristic algorithm is proposed for optimal design of reinforced concrete (RC) frame structures subject to combinations of gravity and lateral static loads based on ACI 318-08 design code. In the present work, artificial bee colony algorithm (ABCA) is focused and an improved ABCA (IABCA) is proposed to achieve the optimization task. The total cost of the RC frames is minimized during...
متن کاملOptimal Operation of Microgrid in the presence of Real-time Pricing Demand Response Program using Artificial Bee Colony Algorithm with a Modified Choice Function
Abstract: Microgrid is one of the newest technologies in power systems. Microgrid can usually has a set of distributed energy resources that makes it able to operate separate from power grid. Optimal operation of microgrids means the optimal dispatch of power resources through day and night hours. This thesis proposed a new method for optimal operation of microgrid. In this method, real-time pr...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملA new approach for data visualization problem
Data visualization is the process of transforming data, information, and knowledge into visual form, making use of humans’ natural visual capabilities which reveals relationships in data sets that are not evident from the raw data, by using mathematical techniques to reduce the number of dimensions in the data set while preserving the relevant inherent properties. In this paper, we formulated d...
متن کامل